北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (4): 102-105.doi: 10.13190/jbupt.201004.102.zhangj

• 论文 • 上一篇    下一篇

多用户MIMO下行系统迭代迫零预编码

张健,刘元安,谢刚,毛峻岭   

  1. 北京邮电大学
  • 收稿日期:2009-10-23 修回日期:2010-04-08 出版日期:2010-08-28 发布日期:2010-05-21
  • 通讯作者: 张健 E-mail:zhangjian1288@gmail.com
  • 基金资助:

    国家级.国家自然科学基金项目;国家级.国家重点基础研究发展计划项目

Iterative ZeroForcing Precoding for Multiuser MIMO Downlink Systems

  • Received:2009-10-23 Revised:2010-04-08 Online:2010-08-28 Published:2010-05-21

摘要:

针对多用户多入多出(MIMO)下行系统,在用户分配单路数据流情况下,提出了一种低复杂度迭代预编码算法.算法使用迫零准则设计预编码向量,采用最大比合并更新接收向量.在用户分配单流时,该算法与已有的迭代NuSVD算法相比,不仅在性能上几乎没有损失,而且单次迭代复杂度的数量级下降为原算法的1/K(K为用户数目,K≥2),总复杂度下降超过50%,仿真结果验证了所提算法的性能.

关键词: 多用户多输入多输出, 预编码, 系统容量, 复杂度

Abstract:

A low complexity iterative precoding algorithm is proposed for multiuser multipl einput multipleoutput (MIMO) downlink systems where a single data stream is allocated to each user. In the algorithm, precoders are designed according to th e zero forcing (ZF) criterion, and receive filters are updated via maximum ratio combining. Assuming one data stream per user, the algorithm has almost no perfo rmance loss compared with the iterative NuSVD algorithm, and the magnitude of co mplexity per iteration is one Kth that of the published one (K denotes t he number of users, K≥2), thus saving more than 50% total complexity costs. Simulations verify the effectiveness of the proposed algorithm.

Key words: multiuser multipleinput multipleoutput, precoding, sum capacity, complexity

中图分类号: